Finite two-distance-transitive graphs of valency 6
نویسندگان
چکیده
A non-complete graph Γ is said to be (G, 2)-distance-transitive if, for i = 1, 2 and for any two vertex pairs (u1, v1) and (u2, v2) with dΓ(u1, v1) = dΓ(u2, v2) = i, there exists g ∈ G such that (u1, v1) = (u2, v2). This paper classifies the family of (G, 2)-distancetransitive graphs of valency 6 which are not (G, 2)-arc-transitive.
منابع مشابه
On Distance-transitive Graphs
Cameron's proof of this result is based on Sims' Conjecture, which has only been shown to hold using the classification of finite simple groups. In the final section of [1], Cameron indicates how Theorem 1 might be proved in an elementary fashion using Macpherson's classification of infinite distance-transitive graphs of finite valency [4]. Corollary 1 below provides the missing portion of this...
متن کاملFINITE s-ARC TRANSITIVE CAYLEY GRAPHS AND FLAG-TRANSITIVE PROJECTIVE PLANES
In this paper, a characterisation is given of finite s-arc transitive Cayley graphs with s ≥ 2. In particular, it is shown that, for any given integer k with k ≥ 3 and k 6= 7, there exists a finite set (maybe empty) of s-transitive Cayley graphs with s ∈ {3, 4, 5, 7} such that all s-transitive Cayley graphs of valency k are their normal covers. This indicates that s-arc transitive Cayley graphs...
متن کاملImprimitive Distance-Transitive Graphs with Primitive Core of Diameter at Least 3
A distance-transitive graph G is one upon which the automorphism group acts transitively on ordered pairs of vertices at every fixed distance. Only connected graphs need to be considered. Those of diameter 2 are the rank-3 graphs, whose careful study was initiated by Donald G. Higman in his breakthrough paper [16]. A huge amount of effort has gone into the classification of all finite distancet...
متن کاملSmith’s Theorem and a characterization of the 6-cube as distance-transitive graph
A generic distance-regular graph is primitive of diameter at least two and valency at least three. We give a version of Derek Smith’s famous theorem for reducing the classification of distance-regular graphs to that of primitive graphs. There are twelve cases—the generic case, four canonical imprimitive cases that reduce to the generic case, and seven exceptional cases. All distance-transitive ...
متن کاملAffine Distance-transitive Groups
A fruitful way of studying groups is by means of their actions on graphs. A very special and interesting class of groups are the ones acting distance-transitively on some graph. A group G acting on a connected graph F = (VT, ET) is said to act distance-transitively if its action on each of the sets {(x, y)\ x, y e VT, d(x, y) = i} is transitive. Here VT and ET stand for the vertices and edges o...
متن کامل